On the Complexity of BDDs for State Space Search: A Case Study in Connect Four

نویسندگان

  • Stefan Edelkamp
  • Peter Kissmann
چکیده

Symbolic search using BDDs usually saves huge amounts of memory, while in some domains its savings are moderate at best. It is an open problem to determine if BDDs work well for a certain domain. Motivated by finding evidences for BDD growths for state space search, in this paper we are concerned with symbolic search in the domain of CONNECT FOUR. We prove that there is a variable ordering for which the set of all possible states – when continuing after a terminal state has been reached – can be represented by polynomial sized BDDs, whereas the termination criterion leads to an exponential number of nodes in the BDD given any variable ordering.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An investigation about the necessity of relationship In-Between spaces on a large scale with a transitional characteristic (Case study: transitional space in four public samples)

Changing a space to a place is the existential purpose of architecture. Literature review regards the complex architectural organization as a significant factor for the maximum use of the individualschr('39') performances and activities. Due to exterior spaceschr('39') necessity beside the interior ones, the architect creates a third space; and due to this in-between space, the complexchr('39')...

متن کامل

Optimization of Mixed-Integer Non-Linear Electricity Generation Expansion Planning Problem Based on Newly Improved Gravitational Search Algorithm

Electricity demand is forecasted to double in 2035, and it is vital to address the economicsof electrical energy generation for planning purposes. This study aims to examine the applicability ofGravitational Search Algorithm (GSA) and the newly improved GSA (IGSA) for optimization of themixed-integer non-linear electricity generation expansion planning (GEP) problem. The performanceindex of GEP...

متن کامل

Reachability checking in complex and concurrent software systems using intelligent search methods

Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...

متن کامل

The evaluation of the physical-spatial indicators of urban street vitality Case Study: The streets around Imam Khomeini Square in Hamedan

Introduction Meeting the social needs of man and creating the necessary opportunities to create vitality in the community requires the existence of physical space. Public space is a huge capacity to respond to this aspect of human life. In fact, urban space is a peripheral structure for social interactions that can be accessed for members of the urban community (Tuleaee, 2003: 110); today, ur...

متن کامل

Reduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)

This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011